Automatikos terminų žodynas. – Vilnius: Technika. Vilius Antanas Geleževičius, Angelė Kaulakienė, Stanislovas Marcinkevičius. 2004.
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
gefärbter Graph — spalvotasis grafas statusas T sritis automatika atitikmenys: angl. coloured graph vok. gefärbter Graph, m rus. раскрашенный граф, m pranc. graphe coloré, m … Automatikos terminų žodynas
graphe coloré — spalvotasis grafas statusas T sritis automatika atitikmenys: angl. coloured graph vok. gefärbter Graph, m rus. раскрашенный граф, m pranc. graphe coloré, m … Automatikos terminų žodynas
spalvotasis grafas — statusas T sritis automatika atitikmenys: angl. coloured graph vok. gefärbter Graph, m rus. раскрашенный граф, m pranc. graphe coloré, m … Automatikos terminų žodynas
раскрашенный граф — spalvotasis grafas statusas T sritis automatika atitikmenys: angl. coloured graph vok. gefärbter Graph, m rus. раскрашенный граф, m pranc. graphe coloré, m … Automatikos terminų žodynas
Ramsey's theorem — This article goes into technical details quite quickly. For a slightly gentler introduction see Ramsey theory. In combinatorics, Ramsey s theorem states that in any colouring of the edges of a sufficiently large complete graph (that is, a simple… … Wikipedia
Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… … Wikipedia
number game — Introduction any of various puzzles and games that involve aspects of mathematics. Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… … Universalium
Littelmann path model — In mathematics, the Littelmann path model is a combinatorial device due to Peter Littelmann for computing multiplicities without overcounting in the representation theory of symmetrisable Kac Moody algebras. Its most important application is to… … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
